On Codes Achieving Zero Error Capacities in Limited Magnitude Error Channels
نویسندگان
چکیده
منابع مشابه
Zero-error list capacities of discrete memoryless channels
We define zero-error list capacities for discrete memoryless channels. We find lower bounds to, and a characterization of these capacities. As is usual for such zero-error problems in information theory, the characterization is not generally a single-letter one. Nonetheless, we exhibit a class of channels for which a single letter characterization exists. We also show how the computational cuto...
متن کاملBidirectional Limited-Magnitude Error Correction Codes for Flash Memories
a BRDF (Bi-Directional Reflection Distribution Function) that measures the Modulation and Coding Techniques for Enhancing Flash Memory Endurance Such code is called an error correcting write-once memory code. rate-limited frameworks, that have treated packet loss, quantization error and delay separately. of magnitude greater than the typical clock-cycle time of the SSD the latency of sluggish N...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملArbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities
We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error criterion to this statement is also established. We use this result together with the robustification and elimination technique developed by Ahlswede in order to gi...
متن کاملLinear covering codes and error-correcting codes for limited-magnitude errors
The concepts of a linear covering code and a covering set for the limitedmagnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2703171